An 11-Step Sorting Network for 18 Elements
نویسندگان
چکیده
Abstract— Sorting Networks are cost-effective multistage interconnection networks with sorting capabilities. These networks theoretically consume Θ(NlogN) comparisons. However, the fastest implementable sorting networks built so far consume Θ(NlogN) comparisons, and generally, use the Merge-sorting strategy to sort the input. An 18-element network using the Merge-sorting strategy needs at least 12 steps-here we show a network that sorts 18 elements in only 11 steps.
منابع مشابه
Optimal Placement and Sizing of Distributed Generation Via an Improved Nondominated Sorting Genetic Algorithm II
The use of distributed generation units in distribution networks has attracted the attention of network managers due to its great benefits. In this research, the location and determination of the capacity of distributed generation (DG) units for different purposes has been studied simultaneously. The multi-objective functions in the optimization model are reducing system line losses; reducing v...
متن کاملDesign, Development and Evaluation of an Orange Sorter Based on Machine Vision and Artificial Neural Network Techniques
ABSTRACT- The high production of orange fruit in Iran calls for quality sorting of this product as a requirement for entering global markets. This study was devoted to the development of an automatic fruit sorter based on size. The hardware consisted of two units. An image acquisition apparatus equipped with a camera, a robotic arm and controller circuits. The second unit consisted of a robotic...
متن کاملExploring the basic elements of successful knowledge management system with presenting a theory through a semantic network
Abstract: Nowadays knowledge is recognized as an important enabler for competitive advantages and many companies are beginning to establish knowledge management systems. Within the last few years many organizations tried to design a suitable knowledge management system and many of them were successful. This paper is to discover critical success factors (CSF) of knowledge management (KM) and the...
متن کاملHow to Sort N Items Using a Sorting Network of Fixed I/O Size
Sorting networks of a xed I/O size p have been used, thus far, for sorting a set of p elements. Somewhat surprisingly, the important problem of using such a sorting network for sorting arbitrarily large data sets has not been addressed in the literature. Our main contribution is to propose a simple sorting architecture whose main feature is the pipelined use of a sorting network of xed I/O size...
متن کاملAn (18/11)n upper bound for sorting by prefix reversals
Thepancake problemasks for theminimumnumber of prefix reversals sufficient for sorting any permutation of length n. We improve the upper bound for the pancake problem to (18/11)n+ O(1) ≈ (1.6363)n. © 2008 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Parallel Processing Letters
دوره 19 شماره
صفحات -
تاریخ انتشار 2009